learn optim divers rank larg document collect learn rank research assum util document independ result learn rank function return redund result approach avoid unsatisfyingli lack theoret foundat scale present learn torank formul optim fraction satisfi user scalabl algorithm explicitli take document similar rank context account present theoret justif approach optim algorithm evalu add optim improv empir perform show algorithm learn order magnitud quickli previou approach budget constrain auction heterogen item rank mechan twitter dlike forum studi problem design mechan rank item forum make user review thumb star rate compar mechan forum user rate individu post mechan user ask perform pairwis comparison state main metric evalu mechan rank accuraci cost review cost measur averag number review post show reason probabl model thumb star base rank mechan produc approxim accur rank bound number review item hand provid review mechan base pairwis comparison achiev approxim rank bound cost implement system shoutveloc twitter forum item tweet twitter rate comparison item user post item requir compar previou entri ensur sequenc post comparison requir review item averag mechan sequenc comparison obtain rank estim ensur item review win entri review obtain estim top item sketch dbase distanc oracl web dscale graph studi fundament problem comput distanc node larg graph web graph social network object answer distanc queri pair node real time standard shortest path algorithm expens approach move time consum shortest path comput offlin queri time precomput valu perform simpl fast comput precomput valu specif offlin phase comput store small sketch node graph queri time sketch sourc destin node perform simpl comput sketch estim distanc categori subject descriptor graph theori graph algorithm path circuit problem revisit examin hypothesi queri specif posit bia learn optim divers rank larg document collect learn rank research assum util document independ result learn rank function return redund result approach avoid unsatisfyingli lack theoret foundat scale present learn torank formul optim fraction satisfi user scalabl algorithm explicitli take document similar rank context account present theoret justif approach optim algorithm evalu add optim improv empir perform show algorithm learn order magnitud quickli previou approach understand fashion cycl social choic sampl neighborhood graph make salsa faster paper attempt improv effect effici queri depend link base rank algorithm hit max salsa rank algorithm view result queri node web graph expand result set includ neighbor node comput score induc neighborhood graph previou work shown salsa substanti effect queri independ link base rank algorithm pagerank work show whittl neighborhood graph consist sampl node edg make salsa cousin faster effici effect offer hypothesi reduc graph improv perform spars cut project graph stream abstract find spars cut import tool analyz larg graph aris practic web graph onlin social commun vlsi circuit deal graph billion node hard visual global partit studi spars cut tradition look cut respect node graph recent work analyz graph properti project small subset vertic interest context relev document queri search engin paper studi spars cut graph partit subset node call partit cut project studi problem find cut project stream model context input graph larg store main memori specif regular graph node cut conduct constant balanc show parti tion randomli chosen set node pass graph stream space choic result partit project cut conduct note lt pass space sublinear number node sampl neighborhood graph make salsa faster paper attempt improv effect effici queri depend link base rank algorithm hit max salsa rank algorithm view result queri node web graph expand result set includ neighbor node comput score induc neighborhood graph previou work shown salsa substanti effect queri independ link base rank algorithm pagerank work show whittl neighborhood graph consist sampl node edg make salsa cousin faster effici effect offer hypothesi reduc graph improv perform axiomat approach result diversif budget constrain auction heterogen item axiomat framework result diversif inform speak diversif search result refer trade relev divers set result articl present unifi framework search result diversif axiomat approach character provid axiomat framework design compar diversif system illustr exampl show diversif object reduc combinatori optim problem facil dispers reduct result algorithm provabl guarante number diversif object bypass rate reduc queri abandon neg infer power min dhash similar search hierarch data object power min hash similar search hierarch estim pagerank graph stream studi focus comput larg graph web graph edg graph present stream object stream model small amount memori prefer linear number node pass stream model show perform graph comput includ estim probabl distribut random walk length mix time conduct estim mix time random walk mn space pass relat mix time conduct estim conduct graph appli algorithm comput probabl distribut web graph estim pagerank node addit error pass min public advertis broker market exploit asymmetri hierarch topic extract dictionari approxim string search longest prefix search programm cluster network router evolv support higher level network function tradit network layer transport layer protocol programm major design issu network devic os ndo recent base type os embed system hand build high perform internet router shelf pc class hardwar cluster technolog goal suez project build cluster base internet router generalpurpos processor input output link control packet schedul gigabit sec system area network switch fabric paper present design initi implement suez os featur scalabl real time packet schedul cach consciou rout tabl lookup intra cluster distribut buffer memori manag highli effici kernel extens mechan activ network usin exploit anarchi network game dtheoret approach combin fair throughput framework algorithm trend analysi massiv tempor data set framework algorithm trend analysi massiv tempor data set mechan equit bandwidth alloc qo budget constraint qo manag educ digit librari environ advanc multimedia comput technolog offer approach support computerassist educ train applic domain interact present tool built enhanc tradit teach method activ learn varieti user expect environ research address incorpor factor present tool interact learn train process present tool handl type delai flexibl adjust qualiti servic qo support paper investig framework systemat strategi support continu synchron retriev present multimedia data stream client server distribut multimedia environ educ digit librari specif establish practic framework multimedia object task schedul synchron buffer model manag distribut multimedia present system buffer manag multimedia databas system deliveri continu synchron multimedia data databas server multipl destin network present challeng area buffer manag factor consid convent buffer manag examin paper investig principl buffer manag multimedia data present object orient databas environ primari goal minim respons time multimedia present ensur continu synchron requir satisfi minimum buffer requir guarante continu synchroni present multimedia data propos prefetch techniqu satisfi requir develop principl techniqu provid user full rang inform requir develop databas environ multimedia present introduct advanc multimedia comput technolog ha netmedia client dserver distribut multimedia environ 